منابع مشابه
Quasi-Implicative Lattices and the Logic of Quantum Mechanics
Mittelstaedt has defined the class of quasi-implicative lattices and shown that an ortholattice (orthocomplemented lattice) is quasi-implicative exactly if it is orthomodular (quasi-modular). He has also shown that the quasi-implication operation is uniquely determined by the quasi-implicative conditions. One of Mittelstaedt's conditions, however, seems to lack immediate intuitive motivation. C...
متن کاملPositive Implicative Ordered Filters of Implicative Semigroups
We introduce the notion of positive implicative ordered filters in implicative semigroups. We show that every positive implicative ordered filter is both an ordered filter and an implicative ordered filter. We give examples that an ordered filter (an implicative ordered filter) may not be a positive implicative ordered filter. We also give equivalent conditions of positive implicative ordered f...
متن کاملSemi-supervised learning on closed set lattices
We propose a new approach for semi-supervised learning using closed set lattices, which have been recently used for frequent pattern mining within the framework of the data analysis technique of Formal Concept Analysis (FCA). We present a learning algorithm, called SELF (SEmi-supervised Learning via FCA), which performs as a multiclass classifier and a label ranker for mixed-type data containin...
متن کاملCompletion of Lattices of Semi-continuous Functions
If U and V are topologies on an abstract set X, then the triple (X, U, V) is a bitopological space. Using the theorem of Priestley on the representation of distributive lattices, results of Dilworth concerning the normal completion of the lattice of bounded, continuous, realvalued functions on a topological space are extended to include the lattice of bounded, semi-continuous, real-valued funct...
متن کاملSemi-primary Lattices and Tableau Algorithms
We develop the theory of semi-primary lattices, a class of modular lattices, including abelian subgroup lattices and invariant subspace lattices, in which an integer partition is assigned to every element and every interval. Flags in these lattices give rise to chains of partitions, which may be encoded as tableaux. In certain of these lattices, Steinberg and van Leeuwen respectively have shown...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1965
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1965-0176944-9